Upper Edge Detour Monophonic Number of a Graph
نویسندگان
چکیده
For a connected graph G of order at least two, a path P is called a monophonic path if it is a chordless path. A longest x−y monophonic path is called an x − y detour monophonic path. A set S of vertices of G is an edge detour monophonic set of G if every edge of G lies on a detour monophonic path joining some pair of vertices in S. The edge detour monophonic number of G is the minimum cardinality of its edge detour monophonic sets and is denoted by edm(G). An edge detour monophonic set S of G is called a minimal edge detour monophonic set if no proper subset of S is an edge detour monophonic set of G. The upper edge detour monophonic number of G, denoted by edm(G), is defined as the maximum cardinality of a minimal edge detour monophonic set of G. We determine bounds for it and characterize graphs which realize these bounds. For any three positive integers b, c and n with 2 ≤ b ≤ n ≤ c, there is a connected graph G with edm(G) = b, edm(G) = c and a minimal edge detour monophonic set of cardinality n.
منابع مشابه
Detour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملEdge-to-vertex Detour Monophonic Number of a Graph
For a connected graph G = (V,E) of order at least three, the monophonic distance dm(u, v) is the length of a longest u− v monophonic path in G. For subsets A and B of V , the monophonic distance dm(A,B) is defined as dm(A,B) = min{dm(x, y) : x ∈ A, y ∈ B}. A u− v path of length dm(A,B) is called an A−B detour monophonic path joining the sets A,B ⊆ V, where u ∈ A and v ∈ B. A set S ⊆ E is called...
متن کاملThe Connected Detour Monophonic Number of a Graph
For a connected graph G = (V,E) of order at least two, a chord of a path P is an edge joining two non-adjacent vertices of P . A path P is called a monophonic path if it is a chordless path. A longest x− y monophonic path is called an x− y detour monophonic path. A set S of vertices of G is a detour monophonic set of G if each vertex v of G lies on an x − y detour monophonic path, for some x an...
متن کاملMonophonic Distance in Graphs
For any two vertices u and v in a connected graph G, a u − v path is a monophonic path if it contains no chords, and the monophonic distance dm(u, v) is the length of a longest u − v monophonic path in G. For any vertex v in G, the monophonic eccentricity of v is em(v) = max {dm(u, v) : u ∈ V}. The subgraph induced by the vertices of G having minimum monophonic eccentricity is the monophonic ce...
متن کاملForcing Total Detour Monophonic Sets in a Graph
For a connected graph G = (V,E) of order at least two, a total detour monophonic set of a graph G is a detour monophonic set S such that the subgraph induced by S has no isolated vertices. The minimum cardinality of a total detour monophonic set of G is the total detour monophonic number of G and is denoted by dmt(G). A subset T of a minimum total detour monophonic set S of G is a forcing total...
متن کامل